KLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning
نویسندگان
چکیده
We present KLMLean 2.0, a theorem prover for propositional KLM logics of nonmonotonic reasoning. KLMLean 2.0 implements some analytic tableaux calculi for these logics recently introduced. KLMLean 2.0 is inspired by the “lean” methodology, it is implemented in SICStus Prolog and it also contains a graphical interface written in Java.
منابع مشابه
KLM Logics of Nonmonotonic Reasoning: Calculi and Implementations
We present proof methods for the logics of nonmonotonic reasoning defined by Kraus, Lehmann and Magidor (KLM). We introduce tableaux calculi (called T S) for all KLM logics. We provide decision procedures for KLM logics based on these calculi, and we study their complexity. Finally, we describe KLMLean 2.0, a theorem prover implementing the calculi T S inspired by the “lean” methodology. KLMLea...
متن کاملKLMLean 1.0: a Theorem Prover for Logics of Default Reasoning
In this paper we present KLMLean 1.0, a theorem prover for some logics of default reasoning, namely Preferential logic P and Loop-Cumulative logic CL introduced by Kraus, Lehmann, and Magidor. KLMLean 1.0 implements some tableaux calculi for these logics recently introduced. It is implemented in SICStus Prolog and also comprises a graphical user interface written in Java. KLMLean 1.0 is availab...
متن کاملAn Implementation of a Free-Variable Tableaux for KLM Preferential Logic P of Nonmonotonic Reasoning: The Theorem Prover FreeP 1.0
In this work we present FREEP 1.0, a theorem prover for the KLM preferential logic P of nonmonotonic reasoning. FREEP 1.0 is a SICStus Prolog implementation of a free-variables, labelled tableau calculus for P, obtained by introducing suitable modalities to interpret conditional assertions. The performances of FREEP 1.0 are promising. FREEP 1.0 can be downloaded at http:// www.di.unito.it/∼pozz...
متن کاملDarr – a Theorem Prover for Constrained and Rational Default Logics
Default logics represent an important class of the nonmonotonic formalisms. Using simple by powerful inference rules, called defaults, these logic systems model reasoning patterns of the form ”in the absence of information to the contrary of. . . ”, and thus formalize the default reasoning, a special type of nonmonotonic reasoning. In this paper we propose an automated system, called DARR, with...
متن کاملTableau Calculi for KLM Logics: extended version
We present tableau calculi for some logics of nonmonotonic reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for all KLM logics, namely preferential, loop-cumulative, cumulative and rational logics. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. We provide a decision procedure for the logics considered, and w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007